The random linear bottleneck assignment problem
نویسندگان
چکیده
منابع مشابه
Approximating the Multi-level Bottleneck Assignment Problem
We consider the multi-level bottleneck assignment problem (MBA). This problem is described in the recent book “Assignment Problems” by Burkard et al. (2009) on pages 188 189. One of the applications described there concerns bus driver scheduling. We view the problem as a special case of a bottleneck m-dimensional multi-index assignment problem. We give approximation algorithms and inapproximabi...
متن کاملAsymptotic Moments of the Bottleneck Assignment Problem
One of the most important variants of the standard linear assignment problem is the bottleneck assignment problem. In this paper we give a method by which one can find all of the asymptotic moments of a random bottleneck assignment problem in which costs (independent and identically distributed) are chosen from a wide variety of continuous distributions. Our method is obtained by determining th...
متن کاملThe Random Quadratic Assignment Problem
The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P . Surprisingly, the QAP has not b...
متن کاملThe Random Hypergraph Assignment Problem
Parisi’s famous (proven) conjecture states that the expected cost of an optimal assignment in a complete bipartite graph on n + n nodes with i. i. d. exponential edge costs with mean 1 is ∑n i=1 1/i , which converges to an asymptotic limit of π/6 as n tends to infinity. We consider a generalization of this question to complete “partitioned” bipartite hypergraphs G2,n that contain edges of size ...
متن کاملOn the Approximability of Multi-level Bottleneck Assignment Problem
We revisit the multi-level bottleneck assignment problem and study the approximability when there are m > 3 sets. We show that with respect to the approximability the problem exhibits an easy to hard transition. More specifically, we give a PTAS to the easiest hard case which is when the alternative edge-sets are complete, and prove that it is NP-hard to approximate the problem to within a rati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1996
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1996300201271